package leetcode;

public class seventeen {
    public static int search(int[] nums, int target) {
        int left=0;
        int right=nums.length-1;
        while(left<=right){ //注意left==right
            int mid=left+(right-left)/2;//防止溢出
            if(nums[mid]>target){
                right=mid-1;
            }else if(nums[mid]<target){
                left=mid+1;
            }else {
                return mid;
            }

        }
        return -1;

    }



    public static void main(String[] args) {
//        nums = [-1,0,3,5,9,12], target = 9
        int[] nums = {-1,0,3,5,9,12};
        int target = 9;
        int search = search(nums, target);
        System.out.println(search);

    }
}
